%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEV408^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 19:24:55 EDT 2023

% Result   : Theorem 5.75s 5.95s
% Output   : Proof 5.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SEV408^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12  % Command    : duper %s
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Thu Aug 24 04:11:35 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 5.75/5.95  SZS status Theorem for theBenchmark.p
% 5.75/5.95  SZS output start Proof for theBenchmark.p
% 5.75/5.95  Clause #0 (by assumption #[]): Eq (Not (Exists fun G => ∀ (A : Iota → Prop), G A → Exists fun B => And (cF B) (∀ (Xx : Iota), A Xx → B Xx))) True
% 5.75/5.95  Clause #1 (by clausification #[0]): Eq (Exists fun G => ∀ (A : Iota → Prop), G A → Exists fun B => And (cF B) (∀ (Xx : Iota), A Xx → B Xx)) False
% 5.75/5.95  Clause #2 (by clausification #[1]): ∀ (a : (Iota → Prop) → Prop),
% 5.75/5.95    Eq (∀ (A : Iota → Prop), a A → Exists fun B => And (cF B) (∀ (Xx : Iota), A Xx → B Xx)) False
% 5.75/5.95  Clause #3 (by clausification #[2]): ∀ (a : (Iota → Prop) → Prop) (a_1 : Iota → Prop),
% 5.75/5.95    Eq (Not (a (skS.0 0 a a_1) → Exists fun B => And (cF B) (∀ (Xx : Iota), skS.0 0 a a_1 Xx → B Xx))) True
% 5.75/5.95  Clause #4 (by clausification #[3]): ∀ (a : (Iota → Prop) → Prop) (a_1 : Iota → Prop),
% 5.75/5.95    Eq (a (skS.0 0 a a_1) → Exists fun B => And (cF B) (∀ (Xx : Iota), skS.0 0 a a_1 Xx → B Xx)) False
% 5.75/5.95  Clause #5 (by clausification #[4]): ∀ (a : (Iota → Prop) → Prop) (a_1 : Iota → Prop), Eq (a (skS.0 0 a a_1)) True
% 5.75/5.95  Clause #10 (by fluidSup #[5, 5]): ∀ (a : Prop), Eq ((fun _ => a) True) True
% 5.75/5.95  Clause #17 (by betaEtaReduce #[10]): ∀ (a : Prop), Eq a True
% 5.75/5.95  Clause #18 (by falseElim #[17]): False
% 5.75/5.95  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------